Statistical Density Estimation Using Threshold Dynamics for Geometric Motion

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Statistical Density Estimation Using Threshold Dynamics for Geometric Motion

Our goal is to estimate a probability density based on discrete point data via segmentation techniques. Since point data may represent certain activities, such as crime, our method can be successfully used for detecting regions of high activity. In this work we design a binary segmentation version of the well-known Maximum Penalized Likelihood Estimation (MPLE) model, as well as a minimization ...

متن کامل

Statistical Topology Using the Nonparametric Density Estimation and Bootstrap Algorithm

This paper presents approximate confidence intervals for each function of parameters in a Banach space based on a bootstrap algorithm. We apply kernel density approach to estimate the persistence landscape. In addition, we evaluate the quality distribution function estimator of random variables using integrated mean square error (IMSE). The results of simulation studies show a significant impro...

متن کامل

Theshold Dynamics for Statistical Density Estimation and Graph Clustering

of the Dissertation Theshold Dynamics for Statistical Density Estimation and Graph Clustering

متن کامل

A geometric framework for density estimation and conditional density estimation

We introduce a geometrically intuitive procedure to obtain an estimator for a probability density function in the absence or presence of predictors. The estimation procedure is based on starting with an initial estimate of the density shape and then transforming it via a warping function to obtain the final estimate. The idea is to design the initial estimate to be computationally fast, albeit ...

متن کامل

Threshold Dynamics for High Order Geometric Motions

In this paper, a class of algorithms for the high order geometric motion of planar curves is developed. The algorithms alternate two simple steps—a convolution and a thresholding step—to evolve planar curves according to combinations of Willmore flow, surface diffusion flow and curvature motion. A distinguishing feature of the methods is that they posses much better stability than typical expli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Scientific Computing

سال: 2012

ISSN: 0885-7474,1573-7691

DOI: 10.1007/s10915-012-9615-6